Super (a, d)-H-antimagic total labelings for shackles of a connected graph H
نویسندگان
چکیده
A simple graph G = (V (G), E(G)) admits an H-covering, if every edge in E(G) belongs to at least one subgraph of G isomorphic to a given graph H. An (a, d)-H-antimagic total labeling of G admitting an H-covering is a bijective function ξ : V (G) ∪ E(G) → {1, 2, . . . , |V (G)| + |E(G)|} such that for all subgraphs H ′ isomorphic to H, the H-weights w(H ′) = ∑
منابع مشابه
On super antimagic total labeling of Harary graph
This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.
متن کاملOn super edge-antimagic total labelings of mKn
A graph G of order p and size q is called (a, d)-edge-antimagic total if there exists a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge-weights w(uv) = f(u) + f(v) + f(uv), uv ∈ E(G), form an arithmetic sequence with first term a and common difference d. The graph G is said to be super (a, d)-edge-antimagic total if the vertex labels are 1, 2, . . . , p. In this p...
متن کاملVertex-antimagic total labelings of graphs
In this paper we introduce a new type of graph labeling, the (a, d)vertex-antimagic total labeling, which is a generalization of several other types of labelings. A connected graph G(V, E) is said to be (a, d)-vertex-antimagic total if there exist positive integers a, d and a bijection λ : V ∪ E → {1, 2, . . . , |V | + |E|} such that the induced mapping gλ : V → W is also a bijection, where W =...
متن کاملFans are cycle-antimagic
A simple graph G = (V,E) admits an H-covering if every edge in E belongs at least to one subgraph of G isomorphic to a given graph H . Then the graph G admitting an H-covering is (a, d)-H-antimagic if there exists a bijection f : V ∪ E → {1, 2, . . . , |V | + |E|} such that, for all subgraphs H ′ of G isomorphic to H , the H ′-weights, wtf(H ′) = ∑ v∈V (H′) f(v) + ∑ e∈E(H′) f(e), form an arithm...
متن کاملSuper Magic and Antimagic Labelings of Disjoint Union of Plane Graphs
SUPER MAGIC AND ANTIMAGIC LABELINGS OF DISJOINT UNION OF PLANE GRAPHS Ali Ahmad, Martin Bača, Marcela Lascsáková, Andrea Semaničová-Feňovčíková 2,3 College of computer and information system, Jazan University, Jazan, Saudi Arabia Department of Appl. Mathematics and Informatics, Technical University, Košice, Slovak Republic Abdus Salam School of Mathematical Sciences, G. C. University, Lahore, P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 57 شماره
صفحات -
تاریخ انتشار 2013